Search results for "Minimum spanning tree-based segmentation"
showing 7 items of 7 documents
Automatic detection of hemangiomas using unsupervised segmentation of regions of interest
2016
In this paper we compare the performances of three automatic methods of identifying hemangioma regions in images: 1) unsupervised segmentation using the Otsu method, 2) Fuzzy C-means clustering (FCM) and 3) an improved region growing algorithm based on FCM (RG-FCM). For each image, the starting point of the algorithms is a rectangular region of interest (ROI) containing the hemangioma. For computing the performances of each method, the ROIs had been manually labeled in 2 classes: pixels of hemangioma and pixels of non-hemangioma. The computed scores are given separately for each image, as well as global performances across all ROIs for both classes. The best classification of non-hemangioma…
A new image segmentation approach using community detection algorithms
2015
Image segmentation has an important role in many image processing applications. Several methods exist for segmenting an image. However, this technique is still a relatively open topic for which various research works are regularly presented. With the recent developments on complex networks theory, image segmentation techniques based on graphs has considerably improved. In this paper, we present a new perspective of image segmentation, by applying three of the most efficient community detection algorithms, Louvain, infomap and stability optimization based on the louvain algorithm, and we extract communities in which the highest modularity feature is achieved. After we show that this measure …
A genetic algorithm for image segmentation
2002
The paper describes a new algorithm for image segmentation. It is based on a genetic approach that allow us to consider the segmentation problem as a global optimization problem (GOP). For this purpose, a fitness function, based on the similarity between images, has been defined. The similarity is a function of both the intensity and the spatial position of pixels. Preliminary results, obtained using real images, show a good performance of the segmentation algorithm.
Image Segmentation based on Genetic Algorithms Combination
2005
The paper describes a new image segmentation algorithm called Combined Genetic segmentation which is based on a genetic algorithm. Here, the segmentation is considered as a clustering of pixels and a similarity function based on spatial and intensity pixel features is used. The proposed methodology starts from the assumption that an image segmentation problem can be treated as a Global Optimization Problem. The results of the image segmentations algorithm has been compared with recent existing techniques. Several experiments, performed on real images, show good performances of our approach compared to other existing methods.
Image Segmentation through a Hierarchy of Minimum Spanning Trees
2012
Many approaches have been adopted to solve the problem of image segmentation. Among them a noticeable part is based on graph theory casting the pixels as nodes in a graph. This paper proposes an algorithm to select clusters in the images (corresponding to relevant segments in the image) corresponding to the areas induced in the images through the search of the Minimum Spanning Tree (MST). In particular is is based on a clustering algorithm that extracts clusters computing a hierarchy of Minimum Spanning Trees. The main drawback of this previous algorithm is that the dimension of the cluster is not predictable and a relevant portion of found clusters can be composed by micro-clusters that ar…
An Image Segmentation Algorithm based on Community Detection
2016
International audience; With the recent advances in complex networks, image segmentation becomes one of the most appropriate application areas. In this context, we propose in this paper a new perspective of image segmentation by applying two efficient community detection algorithms. By considering regions as communities, these methods can give an over-segmented image that has many small regions. So, the proposed algorithms are improved to automatically merge those neighboring regions agglomerative to achieve the highest modularity/stability. To produce sizable regions and detect homogeneous communities, we use the combination of a feature based on the Histogram of Oriented Gradients of the …
Region-based segmentation on depth images from a 3D reference surface for tree species recognition.
2013
International audience; The aim of the work presented in this paper is to develop a method for the automatic identification of tree species using Terrestrial Light Detection and Ranging (T-LiDAR) data. The approach that we propose analyses depth images built from 3D point clouds corresponding to a 30 cm segment of the tree trunk in order to extract characteristic shape features used for classifying the different tree species using the Random Forest classifier. We will present the method used to transform the 3D point cloud to a depth image and the region based segmentation method used to segment the depth images before shape features are computed on the segmented images. Our approach has be…